COMPROMISING RANDOM LINEAR NETWORK CODING AS A CIPHER

 

ABSTRACT

Due to its potential improvement on network throughput, network coding has attracted considerable research interests.  Random Linear Network Coding (RLNC), as a branch of research on network coding, is proposed as a cipher to protect the confidentiality of packets possibly on the future Internet due to its features such as packet mixing in a decentralized approach. In this paper, we propose attacks to compromise RLNC as a cipher for confidentiality protection.  The attacks are based on the blind source separation (BSS) technique, a statistical signal processing technique designed to recover original signals based on mixtures of original signals. We also design the scaling step to filter out artifacts generated by BSS algorithms and the cross-checking steps to increase confidence on packets recovered by the proposed attacks. Our extensive experiments on packets collected from the Internet and a campus network show that the attacks can successfully recover about 1% of original packets.

Keywords - Random Linear Network Coding, Independent Component, Blind Source Separation.